Recursive Self-Similarity for Random Trees, Random Triangulations and Brownian Excursion
نویسنده
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
The genealogy of self-similar fragmentations with negative index as a continuum random tree
We encode a certain class of stochastic fragmentation processes, namely self-similar fragmentation processes with a negative index of self-similarity, into a metric family tree which belongs to the family of Continuum Random Trees of Aldous. When the splitting times of the fragmentation are dense near 0, the tree can in turn be encoded into a continuous height function, just as the Brownian Con...
متن کاملTokunaga and Horton self-similarity for level set trees of Markov chains
The Horton and Tokunaga branching laws provide a convenient framework for studying self-similarity in random trees. The Horton self-similarity is a weaker property that addresses the principal branching in a tree; it is a counterpart of the power-law size distribution for elements of a branching system. The stronger Tokunaga self-similarity addresses so-called side branching. The Horton and Tok...
متن کاملOn a Result of David Aldous concerning the Trees in a Conditioned Excursion
The law of a random tree constructed within a Brownian excursion is calculated conditional on knowing the occupation measure of the excursion. In previous work David Aldous has used random walk approximations to obtain this result. Here it is deduced from Le Gall’s description of the tree in the unconditioned excursion.
متن کاملThe Sde Solved by Local times of a Brownian Excursion or Bridge Derived from the Height Profile of a Random Tree or Forest1 by Jim Pitman
Ž .. Ž . v 4 on the interval 0, V X , where V X inf v: H X du t , and X 0 t t 0 u v Ž . for all v V X . This conditioned form of the Ray Knight description of t Brownian local times arises from study of the asymptotic distribution as ' n and 2k n l of the height profile of a uniform rooted random forest of k trees labeled by a set of n elements, as obtained by conditioning a uniform random mapp...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کامل